Exchanging disks in the tower of hanoi
نویسندگان
چکیده
منابع مشابه
Tower of Hanoi, revisited
Another version of programming ‘The Tower of Hanoi’ in TEX is provided. No nodding knowledge of Lisp is required; just plain TEX. There is no restriction on the number of disks, apart from the installed limits of TEX. Generalized disks can be moved as well.
متن کاملThe Magnetic Tower of Hanoi
In this work I study a modified Tower of Hanoi puzzle, which I term Magnetic Tower of Hanoi (MToH). The original Tower of Hanoi puzzle, invented by the French mathematician Edouard Lucas in 1883, spans "base 2". That is – the number of moves of disk number k is 2^(k-1), and the total number of moves required to solve the puzzle with N disks is 2^N 1. In the MToH puzzle, each disk has two distin...
متن کاملAbstracting the Tower of Hanoi
ing the Tower of Hanoi Craig A. Knoblock School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 [email protected] Abstract This paper describes an automated approach to generating abstractions for the Tower of Hanoi and analyzes the use of these abstractions for problem solving. The analysis shows that the learned abstractions produce an exponential reduction in the size of the...
متن کاملTwo-Player Tower of Hanoi
The Tower of Hanoi game is a classical puzzle in recreational mathematics, which also has a strong record in pure mathematics. In a borderland between these two areas we find the characterization of the minimal number of moves, which is 2n−1, to transfer a tower of n disks. But there are also other variations to the game, involving for example move edges weighted by real numbers. This gives ris...
متن کاملThe Tower of Hanoi and Finite Automata
Some of the algorithms for solving the Tower of Hanoi puzzle can be applied “with eyes closed” or “without memory”. Here we survey the solution for the classical tower of Hanoi that uses finite automata, as well as some variations on the original puzzle. In passing, we obtain a new result on morphisms generating the classical and the lazy tower of Hanoi, and a new result on auomatic sequences.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Mathematics
سال: 1995
ISSN: 0020-7160,1029-0265
DOI: 10.1080/00207169508804452